co-citation graphs

См. также в других словарях:

• Citation analysis — is the examination of the frequency, patterns, and graphs of citations in articles and books.[1][2] It uses citations in scholarly works to establish links to other works or other researchers. Citation analysis is one of the most widely used… …   Wikipedia

• Table of graphs — Table of the orders of the largest known graphs for the undirected Degree Diameter problem= Below is the table of the best known graphs (as of October 2008) in the undirected Degree diameter problem. The following table is the key to the colors… …   Wikipedia

• Color wheel graphs of complex functions — Color wheel graph of complex function sin(1 / z) (according to the first definition). Black parts inside refer to numbers having large absolute values. This function has an essential singularity at z = 0. In mathematics, complex function is a… …   Wikipedia

• Default network — Graphs of the dynamic development of correlations between brain networks. (A) In children the regions are largely local and are organized by their physical location; the frontal regions are highlighted in light blue. (B) In adults the networks… …   Wikipedia

• Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… …   Wikipedia

• Line graph of a hypergraph — The line graph of a hypergraph is the graph whose vertex set is the set of the hyperedges of the hypergraph, with two edges adjacent when they have nonempty intersection. In other words, the line graph of a hypergraph is the intersection graph of …   Wikipedia

• Rook's graph — infobox graph name = Rook s graph image caption = 8x8 Rook s graph vertices = nm edges = nm ( n + m )/2 nm diameter = 2 chromatic number = max( n , m ) chromatic index = girth = 3 (if max( n , m ) ≥ 3) properties = regular, vertex transitive,… …   Wikipedia

• Boxicity — In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969.The boxicity of a graph is the minimum dimension in which a given graph can be represented as an intersection graph of axis parallel boxes. That is, there must… …   Wikipedia

• Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic …   Wikipedia

• Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

• Cactus graph — A cactus graph (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently, every edge in such a graph may belong to at most one cycle.Cactus graphs were first studied under …   Wikipedia